WEAKLY PERFECT GRAPHS ARISING FROM RINGS

Rank-perfect and" weakly rank-perfect graphs

Depth of Edge Rings Arising from Finite Graphs

Let G be a finite graph and K[G] the edge ring of G. Based on the technique of Gröbner bases and initial ideals, it will be proved that, given integers f and d with 7 ≤ f ≤ d, there exists a finite graphG on [d] = {1, . . . , d} with depthK[G] = f and with Krull-dimK[G] = d.

perfect state transfer in unitary cayley graphs over local rings

in this work, using eigenvalues and eigenvectors of unitary cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing pst occurring in its unitary cayley graph. moreover, we have some developments when $r$ is a product of local rings.

Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability

We show that Meyniel weakly triangulated graphs are co-perfectly orderable (equivalently , that P 5-free weakly triangulated graphs are perfectly orderable). Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of Meyniel weakly triangulated graphs.

On generalizations of semiperfect and perfect rings

‎We call a ring $R$ right generalized semiperfect if every simple right $R$-module is an epimorphic image of a flat right $R$-module with small kernel‎, ‎that is‎, ‎every simple right $R$-module has a flat $B$-cover‎. ‎We give some properties of such rings along with examples‎. ‎We introduce flat strong covers as flat covers which are also flat $B$-covers and give characterizations of $A$-perfe...